Polynomial-Time Classical Simulation of Quantum Ferromagnets
نویسندگان
چکیده
منابع مشابه
Polynomial-time classical simulation of quantum ferromagnets
We consider a family of quantum spin systems which includes, as special cases, the ferromagnetic XY model and ferromagnetic Ising model on any graph, with or without a transverse magnetic field. We prove that the partition function of any model in this family can be efficiently approximated to a given relative error ε using a classical randomized algorithm with runtime polynomial in ε^{-1}, sys...
متن کاملPolynomial-time quantum algorithm for the simulation of chemical dynamics.
The computational cost of exact methods for quantum simulation using classical computers grows exponentially with system size. As a consequence, these techniques can be applied only to small systems. By contrast, we demonstrate that quantum computers could exactly simulate chemical reactions in polynomial time. Our algorithm uses the split-operator approach and explicitly simulates all electron...
متن کاملClassical simulation of quantum contextuality
Recently, several inequalities involving sequences of measurements have been proposed which hold for non-contextual models but which are violated in quantum mechanics. They also have been found to be violated in experiments and the violation is independent of the prepared quantum state. A typical contextual model explaining this violation uses a classical memory. We investigate the required mem...
متن کاملClassical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
We consider quantum computations comprising only commuting gates, known as IQP computations, and provide compelling evidence that the task of sampling their output probability distributions is unlikely to be achievable by any efficient classical means. More specifically, we introduce the class post-IQP of languages decided with bounded error by uniform families of IQP circuits with post-selecti...
متن کاملClassical simulation of commuting quantum computations implies collapse of the polynomial
The main goal of the paper is to show that the classical efficient sampling of the IQP circuits’ output probability distribution is equivalent with the collapse of the polynomial hierarchy to its third level ∆3 i.e. it is highly improbable to be possible. Furthermore, it introduces the post-IQP class of languages (along with the IQP circuits augmented with post-selection) and proves that it is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2017
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.119.100503